Scattering invariants in Euler’s two-center problem
نویسندگان
چکیده
منابع مشابه
(n,1,1,α)-Center Problem
Given a set of points in the plane and a constant ,-center problem is to find two closed disks which each covers the whole , the diameter of the bigger one is minimized, and the distance of the two centers is at least . Constrained -center problem is the -center problem in which the centers are forced to lie on a given line . In this paper, we first introduce -center problem and its constrain...
متن کاملInverse scattering problem for the Impulsive Schrodinger equation with a polynomial spectral dependence in the potential
In the present work, under some di¤erentiability conditions on the potential functions , we rst reduce the inverse scattering problem (ISP) for the polynomial pencil of the Scroedinger equation to the corresponding ISP for the generalized matrix Scrödinger equation . Then ISP will be solved in analogy of the Marchenko method. We aim to establish an e¤ective algorithm for uniquely reconstructin...
متن کاملApproximation algorithms for the two-center problem of convex polygon
Given a convex polygon P with n vertices, the two-center problem is to find two congruent closed disks of minimum radius such that they completely cover P . We propose an algorithm for this problem in the streaming setup, where the input stream is the vertices of the polygon in clockwise order. It produces a radius r satisfying r ≤ 2ropt using O(1) space, where ropt is the optimum solution. Nex...
متن کاملA novel approach to the two–center Dirac problem∗
A. N. Artemyev† 1,2, A. Surzhykov1,2, P. Indelicato3, G. Plunien4, and Th. Stöhlker1,2,5 1University of Heidelberg, Germany; 2GSI, Darmstadt, Germany; 3École Normale Supérieure, Paris, France; 4TU Dresden, Germany; 5Helmholtz-Institut Jena, Germany With the recent experimental advances in accelerator and storage ring techniques, novel opportunities arise to study slow collisions between heavy, ...
متن کاملClassical Center Location Problem Under Uncertain Environment
This paper investigates the $p$-center location problem on a network in which vertex weights and distances between vertices are uncertain. The concepts of the $alpha$-$p$-center and the expected $p$-center are introduced. It is shown that the $alpha$-$p$-center and the expected $p$-center models can be transformed into corresponding deterministic models. Finally, linear time algorithms for find...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinearity
سال: 2019
ISSN: 0951-7715,1361-6544
DOI: 10.1088/1361-6544/aaf542